Transformations as Proofs
نویسنده
چکیده
We are concerned primarily with the task of uncovering the precise mathematical proofs which underlie certain semi-formal arguments. In the area of program development the program transformations [BuD77] are an excellent example of semi-formality, since, as is well known, the calculus of transformations is not, in general, sound1, and it is capable of effecting significant shifts in logical complexity by, what superficially appears to be, equational manipulation. In [Hen93] we provided an interpretation of certain transformations over N as derivations within a theory of operations and types (the theoryEON of [Bee85]). The main results can be summarised as follows: Let π range over the transformations PT . The interpretation [ _ ] maps PT into Der(EON) + {fail} where Der(EON) is the set of proof derivations in the theory EON.
منابع مشابه
Automating Proofs of Partially Ordered Model Transformations
This report discusses the feasibility of automating the proofs of transformations between partially ordered models. It extends the work of the author’s initial report [12] on model transformations with constructive type theory, by formalising a model as a partial order over classes, and a model transformation as a nested set of pre and post-conditions. This opens up the proofs of common kinds o...
متن کاملAssembling the Proofs of Ordered Model Transformations
In model-driven development, an ordered model transformation is a nested set of transformations between source and target classes, in which each transformation is governed by its own pre and postconditions, but structurally dependent on its parent. Following the proofs-as-model-transformations approach, in this paper we consider a formalisation in Constructive Type Theory of the concepts of mod...
متن کاملTransformations of specifications and proofs to support an evolutionary formal software development
Like other software engineering activities, formal modelling needs to deal with change: bugs and omissions need to be corrected, and changes from the outside need to be dealt with. In the context of axiomatic specifications and (partly) interactive proofs, the main obstacle is that changes invalidate proofs, which then need to be rebuilt using an inhibitive amount of resources. This thesis prop...
متن کاملSuccinct Malleable NIZKs and an Application to Compact Shuffles
Depending on the application, malleability in cryptography can be viewed as either a flaw or — especially if sufficiently understood and restricted — a feature. In this vein, Chase, Kohlweiss, Lysyanskaya, and Meiklejohn recently defined malleable zero-knowledge proofs, and showed how to control the set of allowable transformations on proofs. As an application, they construct the first compact ...
متن کاملArray Form Transformations: Proofs of Correctness1
In [FSCB95], a set of program transformations for converting a simple, functional form into a whole-array form suitable for execution on an array processor is discussed (some components of the whole-array form are biased towards the AMT DAP array processor [PL90], which has a 2-dimensional array of processors). The initial form operated on by the transformations uses a small number of powerful ...
متن کاملOn Transformations of Constant Depth Propositional Proofs
This paper studies the complexity of constant depth propositional proofs in the cedent and sequent calculus. We discuss the relationships between the size of tree-like proofs, the size of dag-like proofs, and the heights of proofs. The main result is to correct a proof construction in an earlier paper about transformations from proofs with polylogarithmic height and constantly many formulas per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993